Oppositional Jaya Algorithm With Distance-Adaptive Coefficient in Solving Directional Over Current Relays Coordination Problem
نویسندگان
چکیده
منابع مشابه
Considering Pilot Protection in the Optimal Coordination of Distance and Directional Overcurrent Relays
The aim of the relay coordination is that protection systems detect and isolate the faulted part as fast and selective as possible. On the other hand, in order to reduce the fault clearing time, distance protection relays are usually equipped with pilot protection schemes. Such schemes can be considered in the distance and directional overcurrent relays (D&DOCRs) coordination to achieve faster ...
متن کاملOptimal Coordination of Distance and Directional Overcurrent Relays Considering Different Network Topologies
Most studies in relay coordination have focused solely on coordination of overcurrent relays while distance relays are used as the main protection of transmission lines. Since, simultaneous coordination of these two types of relays can provide a better protection, in this paper, a new approach is proposed for simultaneous coordination of distance and directional overcurrent relays (D&DOCRs). Al...
متن کاملEfficient Dimensionality Reduction of Directional Overcurrent Relays Optimal Coordination Problem
Directional over current relays (DOCR) are commonly used in power system protection as a primary protection in distribution and sub-transmission electrical systems and as a secondary protection in transmission systems. Coordination of protective relays is necessary to obtain selective tripping. In this paper, an approach for efficiency reduction of DOCRs nonlinear optimum coordination (OC) is p...
متن کاملA Novel Objective Function for Directional Overcurrent Relays Coordination
Directional overcurrent relays (DOCRs) are widely used to protect power systems. For optimal coordination of DOCRs, several techniques have been proposed to solve this problem. A common way of optimal coordination of DOCRs is using evolutionary algorithms such as genetic algorithm (GA). In this paper, a novel strategy for DOCRs coordination is proposed. In the proposed strategy, a new objective...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2947626